Correlation bounds for polynomials over {0, 1}1
نویسنده
چکیده
This article is a unified treatment of the state-of-the-art on the fundamental challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over {0, 1}. It discusses long-standing results and recent developments, related proof techniques, and connections with pseudorandom generators. It also suggests several research directions.
منابع مشابه
On Improved Degree Lower Bounds for Polynomial Approximation
A polynomial P ∈ F[X1, . . . , Xn] is said to ε-approximate a boolean function F : {0, 1} → {0, 1} under distribution D over {0, 1} if Prx∼D[P (x) 6= F (x)] ≤ ε. Smolensky (1987) showed that for any constant primes p 6= q, any polynomial P ∈ Fp[x1, . . . , xn] that ( 1 2q − Ω(1))-approximates the boolean function MODq : {0, 1} → {0, 1} – which accepts its input iff the number of ones is non-zer...
متن کاملOn Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F (x) ≡ P (x) (mod M) for all x ∈ {0, 1} . Similarly, P one-sidedly M -represents F if F (x) = 0 ⇐⇒ P (x) ≡ 0 (mod M) for all x ∈ {0, 1} . Lower bounds are obtained on the degree and the number of monomials of polynomials over ZZM , which strongly or one-sidedly M -represent the Boolean function deciding if a given nb...
متن کاملSymmetric polynomials over Zm and simultaneous communication protocols
We study the problem of representing symmetric Boolean functions as symmetric polynomials over Zm. We show an equivalence between such representations and simultaneous communication protocols. Computing a function f on 0 1 inputs with a polynomial of degree d modulo pq is equivalent to a two player simultaneous protocol for computing f where one player is given the first dlogp de digits of the ...
متن کاملOn polynomial approximations over $\mathbb{Z}/2^k\mathbb{Z}$
We study approximation of Boolean functions by low-degree polynomials over the ring Z/2kZ. More precisely, given a Boolean function F : {0, 1}n → {0, 1}, define its k-lift to be Fk : {0, 1}n → {0, 2k−1} by Fk(x) = 2k−F(x) (mod 2k). We consider the fractional agreement (which we refer to as γd,k(F)) of Fk with degree d polynomials from Z/2 Z[x1, . . . , xn]. Our results are the following: • Incr...
متن کاملThe Correlation Between Parity and Quadratic Polynomials
We prove exponentially small upper bounds on the correlation between parity and quadratic polynomials mod 3. One corollary of this is that in order to compute parity, circuits consisting of a threshold gate at the top, mod 3 gates in the middle, and AND gates of fan-in two at the inputs must be of size 2. This is the first result of this type for general mod 3 subcircuits with ANDs of fan-in gr...
متن کامل